Approximating the Pareto Set of Multiobjective Linear Programs Via Robust Optimization
نویسندگان
چکیده
منابع مشابه
Approximating the Pareto set of multiobjective linear programs via robust optimization
The Pareto set of a multiobjective optimization problem consists of the solutions for which one or more objectives can not be improved without deteriorating one or more other objectives. We consider problems with linear objectives and linear constraints and use Adjustable Robust Optimization and Polynomial Optimization as tools to approximate the Pareto set with polynomials of arbitrarily large...
متن کاملRobust optimization model for uncertain multiobjective linear programs
In this paper, we consider the multiobjective linear programs where coefficients in the objective function belong to uncertainty sets. We introduce the concept of robust efficient solutions to uncertain multiobjective linear programming problems. By using two scalarization methods, the weighted sum method and the ϵ-constraint method, we obtain that the robust efficient solutions for uncertain m...
متن کاملDistributed Generation Planning via Strength Pareto Multiobjective Optimization Approach
Owing to the incremental demands for electrical energy, distributed generation (DG) sources are becoming more important in distribution systems. Locations and capacities of DG sources have profoundly impacted on the system losses in a distribution network. In this paper, a novel Strength Pareto Evolutionary Algorithm (SPEA) is represented for optimal location and sizing of DG on distribution sy...
متن کاملApproximating convex pareto surfaces in multiobjective radiotherapy planning.
Radiotherapy planning involves inherent tradeoffs: the primary mission, to treat the tumor with a high, uniform dose, is in conflict with normal tissue sparing. We seek to understand these tradeoffs on a case-to-case basis, by computing for each patient a database of Pareto optimal plans. A treatment plan is Pareto optimal if there does not exist another plan which is better in every measurable...
متن کاملA decomposition method for approximating Pareto frontier in Multiobjective Integer Linear Problems
where x is an n-dimensional vector of variables, A is an m × n matrix, b is the RHS vector and the vectors ci (i = 1, ...,m) represent the coefficients of the objective functions (criteria). Let’s denote yi = fi(x), i = 1, ...,m, and let y = (y1, ..., ym) be a vector in the criteria space. The set Y ⊂ Rm composed by all possible criterion vectors y = f(x) when x ∈ X, is known as Feasible Criter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2012
ISSN: 1556-5068
DOI: 10.2139/ssrn.2038741